Optimizing GoTools' Search Heuristics using Genetic Algorithms

نویسندگان

  • Matthew Pratola
  • Thomas Wolf
چکیده

GoTools is a program which solves life & death problems in the game of Go. This paper describes experiments using a Genetic Algorithm to optimize heuristic weights used by GoTools’ tree-search. The complete set of heuristic weights is composed of di erent subgroups, each of which can be optimized with a suitable tness function. As a useful side product, an MPI interface for FreePascal was implemented to allow the use of a parallelized tness function running on a Beowulf cluster. The aim of this exercise is to optimize the current version of GoTools, and to make tools available in preparation of an extension of GoTools for solving open boundary life & death problems, which will introduce more heuristic parameters to be ne tuned.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits

Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...

متن کامل

Efficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits

Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...

متن کامل

Using and comparing metaheuristic algorithms for optimizing bidding strategy viewpoint of profit maximization of generators

With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...

متن کامل

STABILITY BASED OPTIMUM DESIGN OF CONCRETE GRAVITY DAM USING CSS, CBO AND ECBO ALGORITHMS

This study presents shape optimization of a gravity dam imposing stability and principal stress constraints. A gravity dam is a large scale hydraulic structure consisting of huge amount of concrete material. Hence, an optimum design gives a cost-benefit structure due to the fact that small changes in shape of dam cross-section leads to large saving of concrete volume. T...

متن کامل

Addressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics

In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ICGA Journal

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2003